n = input()
if int(n) < 3:
print(-1)
else:
n = 10**(int(n)-1)
ans = n//210
ans = int(ans) + 1
ans *= 210
print(ans)
#include<iostream>
#include<cmath>
using namespace std;
//50 80 170 20 200 110
int n;
int a[6]={50,80,170,20,200,110};
int b[6]={2,2,3,2,3,3};
int main(){
cin>>n;
if(n<3) cout<<"-1";
else if(n==3) cout<<"210";
else {
cout<<"1";
int x=(n-4)%6;
for(int i=0;i<n-1-b[x];i++) cout<<"0";
cout<<a[x];
}
}
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |